Model Completeness, Uniform Interpolants and Superposition Calculus

Abstract Uniform interpolants have been largely studied in non-classical propositional logics since the nineties; a successive research line within automated reasoning community investigated uniform quantifier-free (sometimes referred to as “covers”) first-order theories. This further is motivated by fact that offer an effective solution tackle quantifier elimination and symbol problems, which are central model checking infinite state systems. was first pointed out ESOP 2008 Gulwani Musuvathi, then authors of present contribution context recent applications verification data-aware processes. In this paper, we show how covers strictly related completions, well-known topic theory. We also investigate computation Superposition Calculus, adopting constrained version calculus defining appropriate settings reduction strategies. addition, computing computationally tractable for fragment language used when tackling observation confirmed analyzing preliminary results obtained using mcmt tool verify relevant examples These can be found last distribution.